Numeric Identifier Transmission Algorithm Using Hash Function

نویسندگان

چکیده

When developing programs or websites, it is very convenient to use relational databases, which contain powerful and tools that allow work with data flexibly get the necessary information in a matter of milliseconds. A database consists tables records these tables, each table must have primary key, particular, can be number BIGINT type, unique index record table, allows fetch operation maximum speed O (1) complexity. After writing row database, program receives identifier ID form number, future this used obtain record. In case website, could GET method http protocol entry request. But often happens transmission an clear not safe, both for business reasons security access information. And case, create additional functionality checking rights come up way encode such would impossible determine identifier, this, turn, leads fact code becomes much more complicated also increases amount data, ensure program. This article presents algorithm solves problems “on fly” without complicating application logic does require resources store Also, reliable since based on hash functions synthesized as result many years related complex systems increased level performance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable Transmission of Packet Using Homomorphic Hash Function

Privacy threat is one of the critical issues in wireless networks, where attacks such as traffic analysis and flow tracing can be easily launched by a malicious adversary due to the open wireless medium. Network coding has the potential to thwart these attacks since the coding/mixing operation is encouraged at intermediate nodes. However, the simple deployment of network coding cannot achieve t...

متن کامل

Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm

Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...

متن کامل

An Improved Hash Function Based on the Tillich-Zémor Hash Function

Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.

متن کامل

Text Data Fusion to Speech Signal Using Hash Function Algorithm

Proposed paper work concentrates on the secure transmission of text data when digital contents are commonly distributed by Internet and more security attacks are appeared from eavesdropping, data exposure and data tampering. In this paper we concentrate on hiding some secret text into a real time speech signal considering PSNR (Peak-Signal-to-Noise Ratio) and duration of speech signal as key pa...

متن کامل

A fast segmentation algorithm for piecewise polynomial numeric function generators

We give an efficient algorithm for partitioning the domain of a numeric function f into segments. The function f is realized as a polynomial in each segment, and a lookup table stores the coefficients of the polynomial. Such an algorithm is an essential part of the design of lookup table methods [5,8,9,12,14,15] for realizing numeric functions, such as sin(πx), ln(x), and √ −ln(x). Our algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Open Journal of Applied Sciences

سال: 2023

ISSN: ['2165-3917', '2165-3925']

DOI: https://doi.org/10.4236/ojapps.2023.139125